Algebraic tori in cryptography
نویسندگان
چکیده
We give a mathematical interpretation in terms of algebraic tori of Lucas-based cryptosystems, XTR, and the conjectural generalizations in [2]. We show that the varieties underlying these systems are quotients of algebraic tori by actions of products of symmetric groups. Further, we use these varieties to disprove conjectures from [2].
منابع مشابه
Constructive and destructive facets of torus-based cryptography
We introduce a constructive model for algebraic tori based on reduced divisors on singular curves. By using a singular hyperelliptic model, this provides an alternative representation, and computational model, for groups of rational points on an algebraic tori [4]. We obtain a represention of elements on certain tori of dimension r in compact representation using r +1 elements. By embedding the...
متن کاملOn small degree extension fields in cryptology
This thesis studies the implications of using public key cryptographic primitives that are based in, or map to, the multiplicative group of finite fields with small extension degree. A central observation is that the multiplicative group of extension fields essentially decomposes as a product of algebraic tori, whose properties allow for improved communication efficiency. Part I of this thesis ...
متن کاملOn the Discrete Logarithm Problem on Algebraic Tori
Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm problem that works directly in these groups. Using a prototype implementation, we obtain practical upper bounds for the difficulty of solving the DLP in the tori T2(Fpm) and T6(Fpm) for various p and m. Our results do not affect ...
متن کاملUsing Primitive Subgroups to Do More with Fewer Bits
This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of algebraic tori and abelian varieties.
متن کاملCompression in Finite Fields and Torus-Based Cryptography
We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key cryptosystems called T2 and CEILIDH, we disprove some conjectures, and we use the theory of algebraic tori to give a better understanding of our cryptosystems, the Lucas-based, XTR and Gong-Harn cryptosystems, and conjectured ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003